2010 / 69 Lower bounds rule ! Roland
نویسنده
چکیده
We propose two axioms that introduce lower bounds into resource monotonicity requirements for rules for the problem of adjudicating conflicting claims. Suppose the amount to divide increases. The first axiom requires that two claimants whose lower bound changes equally experience an equal change in awards. The second axiom requires that extra resources are divided only among those claimants who experience a strictly positive change in their lower bound. We show that, in the two-claimant case, Concede-and-Divide is the only rule that satisfies both axioms when the axioms are defined over a large set of lower bounds that include the minimal rights lower bound and the secured lower bound. We also show that, in the n-claimant case where at least one claimant claims the total amount, the Minimal Overlap rule is the only rule that satisfies both axioms when the axioms are defined over the secured lower bound.
منابع مشابه
A decision rule for imprecise probabilities based on pair-wise comparison of expectation bounds
There are many ways to extend the classical expected utility decision rule to the case where uncertainty is described by (convex) probability sets. In this paper, we propose a simple new decision rule based on the pair-wise comparison of lower and upper expected bounds. We compare this rule to other rules proposed in the literature, showing that this new rule is both precise, computationally tr...
متن کاملImproved Bounds for the Chromatic Number of the Lexicographic Product of Graphs
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and generalizes several known results is proved. It is applied in particular to characterize graphs that have a complete core. An improved lower bound is also given.
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کامل